The Elekes-Szabó Theorem in four dimensions

نویسندگان

  • Orit E. Raz
  • Micha Sharir
  • Frank de Zeeuw
چکیده

Let F ∈ C[x, y, s, t] be an irreducible constant-degree polynomial, and let A,B,C,D ⊂ C be finite sets of size n. We show that F vanishes on at most O(n8/3) points of the Cartesian product A × B × C × D, unless F has a special group-related form. A similar statement holds for A,B,C,D of unequal sizes, with a suitably modified bound on the number of zeros. This is a fourdimensional extension of our recent improved analysis of the original ElekesSzabó theorem in three dimensions. We give three applications: an expansion bound for three-variable real polynomials that do not have a special form, a bound on the number of coplanar quadruples on a space curve that is neither planar nor quartic, and a bound on the number of four-point circles on a plane curve that has degree at least five.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited

Let F ∈ C[x, y, z] be a constant-degree polynomial, and let A,B,C ⊂ C with |A| = |B| = |C| = n. We show that F vanishes on at most O(n11/6) points of the Cartesian product A×B×C (where the constant of proportionality depends polynomially on the degree of F ), unless F has a special group-related form. This improves a theorem of Elekes and Szabó [2], and generalizes a result of Raz, Sharir, and ...

متن کامل

Chapter 6 : The Elekes - Sharir - Guth - Katz Framework

Guth and Katz’s seminal work on the number of distinct distances [4] was based on several novel ideas. One can regard their proof of as consisting of four main tools: (i) A reduction from the distinct distances problem to a problem about line intersections in R. This part is usually referred to as the Elekes-Sharir framework. We will refer to it as the Elekes-Sharir-Guth-Katz framework, for rea...

متن کامل

Distinct Distances from Three Points

Let p1, p2, p3 be three noncollinear points in the plane, and let P be a set of n other points in the plane. We show that the number of distinct distances between p1, p2, p3 and the points of P is Ω(n), improving the lower bound Ω(n) of Elekes and Szabó [4] (and considerably simplifying the analysis).

متن کامل

A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?

We give a very general sufficient condition for a one–parameter family of curves not to have n members with “too many” (i.e. a near–quadratic number of) triple points of intersections. As a special case, a combinatorial distinction between straight lines and unit circles will be shown. (Actually, this is more than just a simple application; originally this motivated our results.)

متن کامل

2 00 7 Less than continuum many translates of a compact nullset may cover any infinite profinite group Miklós

Less than continuum many translates of a compact nullset may cover any infinite profinite group Abstract We show that it is consistent with the axioms of set theory that every infinite profinite group G possesses a closed subset X of Haar measure zero such that less than continuum many translates of X cover G. This answers a question of Elekes and Tóth and by their work settles the problem for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1607.03600  شماره 

صفحات  -

تاریخ انتشار 2016